Setup-driving Verifiably Committed Signatures Within Standard Complexity Mode

In this paper, a setup-driving verifiably committed signature based on the strong RSA assumption within the standard complexity model is presented. The idea behind our construction is that given any valid partial signature of a message m, if an arbitrator with its auxiliary input is able to generate variables called the resolution of messagem such that the distribution of the resulting variables is indistinguishable from that generated by the primary signer alone from the viewpoints of all verifiers, then from which a committed signature can be derived.